Divergence and Sufficiency for Convex Optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divergence and Sufficiency for Convex Optimization

Logarithmic score and information divergence appear in both information theory, statistics, statistical mechanics, and portfolio theory. We demonstrate that all these topics involve some kind of optimization that leads directly to the use of Bregman divergences. If the Bregman divergence also fulfills a sufficiency condition it must be proportional to information divergence. We will demonstrate...

متن کامل

Generic identifiability and second-order sufficiency in tame convex optimization

We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, “tame”). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the feasible region is “partly smooth”, ensuring finite identification of the manifold by many optimization algorithms. Furthermore, second-order optimality condition...

متن کامل

f-Divergence for convex bodies

We introduce f -divergence, a concept from information theory and statistics, for convex bodies in R. We prove that f -divergences are SL(n) invariant valuations and we establish an affine isoperimetric inequality for these quantities. We show that generalized affine surface area and in particular the Lp affine surface area from the Lp Brunn Minkowski theory are special cases of f -divergences.

متن کامل

Sufficiency for Gaussian Hypergeometric Functions to Be Uniformly Convex

Let F(a,b;c;z) be the classical hypergeometric function and f be a normalized analytic functions defined on the unit disk . Let an operator Ia,b;c(f ) be defined by [Ia,b;c(f )](z)= zF(a,b;c;z)∗f(z). In this paper the authors identify two subfamilies of analytic functions 1 and 2 and obtain conditions on the parameters a,b,c such that f ∈ 1 implies Ia,b;c(f )∈ 2.

متن کامل

Convex Divergence ICA

Independent component analysis (ICA) is vital for unsupervised learning and blind source separation (BSS). The ICA unsupervised learning procedure attempts to demix the observation vectors and identify the salient features or mixture sources. This work presents a novel contrast function for evaluating the dependence among sources. A convex divergence measure is developed by applying the convex ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2017

ISSN: 1099-4300

DOI: 10.3390/e19050206